Notes on quantum coherence with $$l_1$$-norm and convex-roof $$l_1$$-norm
نویسندگان
چکیده
In this work, we evaluate quantum coherence using the $$l_{1}$$ -norm and convex-roof obtain several new results. First, provide some general triangle-like inequalities of coherence, with results better than existing ones. Second, for special three-dimensional states, a method calculating is presented. Lastly, offer distinct upper bounds in measure based on state itself.
منابع مشابه
Robust Multiview Registration of 3D Surfaces via L_1-norm Minimization
In this paper we present a robust method for simultaneous registration of multiple 3D scans. Rigid registration is an important task in many applications such as surface reconstruction, navigation and computer aided design. The goal of 3-D (rigid) registration is to align surfaces through a (rigid) transformation. A large number of existing registration algorithms are dependent on finding match...
متن کاملExtra Gain: Improved Sparse Channel Estimation Using Reweighted l_1-norm Penalized LMS/F Algorithm
The channel estimation is one of important techniques to ensure reliable broadband signal transmission. Broadband channels are often modeled as a sparse channel. Comparing with traditional dense-assumption based linear channel estimation methods, e.g., least mean square/fourth (LMS/F) algorithm, exploiting sparse structure information can get extra performance gain. By introducing -norm penalty...
متن کامل$L_1/\ell_1$-to-$L_1/\ell_1$ analysis of linear positive impulsive systems with application to the $L_1/\ell_1$-to-$L_1/\ell_1$ interval observation of linear impulsive and switched systems
Sufficient conditions characterizing the asymptotic stability and the hybrid L1/`1-gain of linear positive impulsive systems under minimum and range dwell-time constraints are obtained. These conditions are stated as infinite-dimensional linear programming problems that can be solved using sum of squares programming, a relaxation that is known to be asymptotically exact in the present case. The...
متن کاملFinite-Time Distributed Linear Equation Solver for Minimum $l_1$ Norm Solutions
This paper proposes distributed algorithms for multi-agent networks to achieve a solution in finite time to a linear equation Ax = b where A has full row rank, and with the minimum l1-norm in the underdetermined case (where A has more columns than rows). The underlying network is assumed to be undirected and fixed, and an analytical proof is provided for the proposed algorithm to drive all agen...
متن کاملAlgorithmic linear dimension reduction in the l_1 norm for sparse vectors
We can recover approximately a sparse signal with limited noise, i.e, a vector of length d with at least d − m zeros or near-zeros, using little more than m log(d) nonadaptive linear measurements rather than the d measurements needed to recover an arbitrary signal of length d. Several research communities are interested in techniques for measuring and recovering such signals and a variety of ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2021
ISSN: ['1573-1332', '1570-0755']
DOI: https://doi.org/10.1007/s11128-021-03325-4